On termination of confluent one-rule string-rewriting systemsSHIKISHIMA-TSUJI, K; KATSURA, M; KOBAYASHI, Y et al.Information processing letters. 1997, Vol 61, Num 2, pp 91-96, issn 0020-0190Article

Parallel modular multiplication with table look-upCHE WUN CHIOU; YANG, T. C.International journal of computer mathematics. 1998, Vol 69, Num 1-2, pp 49-55, issn 0020-7160Article

Computationally equivalent elimination of conditionsSERBANUTA, Traian Florin; ROSU, Grigore.Lecture notes in computer science. 2006, pp 19-34, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 16 p.Conference Paper

Termination of (canonical) context-sensitive rewritingLUCAS, Salvador.Lecture notes in computer science. 2002, pp 296-310, issn 0302-9743, isbn 3-540-43916-1, 15 p.Conference Paper

Higher-order rewritingVAN RAAMSDONK, F.Lecture notes in computer science. 1999, pp 220-239, issn 0302-9743, isbn 3-540-66201-4Conference Paper

JITty: A rewriter with strategy annotationsVAN DE POL, Jaco.Lecture notes in computer science. 2002, pp 367-370, issn 0302-9743, isbn 3-540-43916-1, 4 p.Conference Paper

Conditional rewrite rulesKAPLAN, S.Theoretical computer science. 1984, Vol 33, Num 2-3, pp 175-193, issn 0304-3975Article

Systèmes de réécriture avec sélecteur = Rewriting systems with selectorMOREAU, Philippe.1984, 168 fThesis

A uniform framework for term and graph rewriting applied to combined systemsOHLEBUSCH, E.Information processing letters. 2000, Vol 73, Num 1-2, pp 53-59, issn 0020-0190Article

Modular properties of conditional term rewriting systemsMIDDELDORP, A.Information and computation (Print). 1993, Vol 104, Num 1, pp 110-158, issn 0890-5401Article

Knuth-Bendix procedure and non deterministic behavior- an example; Procédure de Knuth-Bendix et indéterminisme - un exempleGNAEDIG, I.Rapports de recherche - INRIA. 1987, Vol 733, issn 0249-6399, 10 p.Report

Communication of Two Stacks and RewritingKARHUMÄKI, Juhani; KUNC, Michal; OKHOTIN, Alexander et al.Lecture notes in computer science. 2006, pp 468-479, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Construction d'un plus petit ordre de simplification = Construction of the smallest simplification orderingJOUANNAUD, J. P; KIRCHNER, H.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 191-208, issn 0399-0540Article

Dependency pairs for simply typed term rewritingAOTO, Takahito; YAMADA, Toshiyuki.Lecture notes in computer science. 2005, pp 120-134, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

Autowrite: A tool for checking properties of term rewriting systemsDURAND, Irène.Lecture notes in computer science. 2002, pp 371-375, issn 0302-9743, isbn 3-540-43916-1, 5 p.Conference Paper

On weakly confluent monadic string-rewriting systemsMADLENER, K; NARENDRAN, P; OTTO, F et al.Theoretical computer science. 1993, Vol 113, Num 1, pp 119-165, issn 0304-3975Conference Paper

Preuves de terminaison des systèmes de réécriture associatifs commutatifs : une méthode fondée sur la réécriture elle-même = Termination proof for associative commutative rewriting systems: a method bared on the rewriting it-selfGNAEDIG, Isabelle.1986, 73 fThesis

Adding algebraic rewriting to the untyped lambda calculus = Ajout de la réécriture algébrique au lambda calcul non typéDOUGHERTY, D. J.Information and computation (Print). 1992, Vol 101, Num 2, pp 251-267, issn 0890-5401Article

RAPT : A program transformation system based on term rewritingCHIBA, Yuki; AOTO, Takahito.Lecture notes in computer science. 2006, pp 267-276, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 10 p.Conference Paper

Finite complete rewriting systems and the complexity of the word problemBAUER, G; OTTO, F.Acta informatica. 1984, Vol 21, Num 5, pp 521-540, issn 0001-5903Article

A type-based termination criterion for dependently-typed higher-order rewrite systemsBLANQUI, Frédéric.Lecture notes in computer science. 2004, pp 24-39, issn 0302-9743, isbn 3-540-22153-0, 16 p.Conference Paper

The undecidability of the unification and matching problem for canonical theoriesHEILBRUNNER, S; HÖLLDOBLER, S.Acta informatica. 1987, Vol 24, Num 2, pp 157-171, issn 0001-5903Article

RTA 2003 : rewriting techniques and applications (Valencia, 9-11 June 2003)Nieuwenhuis, Robert.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40254-3, XI, 514 p, isbn 3-540-40254-3Conference Proceedings

Fairness on synchronized EOL array systemsNALINAKSHI NIRMAL; RAMA, R.International journal of computer mathematics. 1988, Vol 25, Num 1, pp 5-16, issn 0020-7160Article

Term rewriting and applications (17th international conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006)Pfenning, Frank.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-36834-5, 1Vol, XIII-414 p, isbn 3-540-36834-5Conference Proceedings